MIDAS: A mixed integer dynamic approximation scheme
نویسندگان
چکیده
منابع مشابه
Developing a Mixed Integer Quadratic Programing Model with Integer Numbers for Designing a Dynamic closed-loop Logistics Network
Logistics Network Design includes network configuration decisions having long-standing influences on other tactical and operational decisions. Recently, regarding environmental issues and customer awareness and global warming closed-loop supply chain network design is taken into consideration. The proposed network for the integrated forward and reverse logistics is developed by formulating a cy...
متن کاملThe integer approximation error in mixed-integer optimal control
We extend recent work on nonlinear optimal control problems with integer restrictions on some of the control functions (mixed-integer optimal control problems, MIOCP). We improve a theorem [25] that states that the solution of a relaxed and convexified problem can be approximated with arbitrary precision by a solution fulfilling the integer requirements. Unlike in previous publications the new ...
متن کاملPolyhedral approximation in mixed-integer convex optimization
Generalizing both mixed-integer linear optimization and convex optimization, mixed-integer convex optimization possesses broad modeling power but has seen relatively few advances in general-purpose solvers in recent years. In this paper, we intend to provide a broadly accessible introduction to our recent work in developing algorithms and software for this problem class. Our approach is based o...
متن کاملA convex approximation for mixed-integer recourse models
We develop a convex approximation for two-stage mixed-integer recourse models and we derive an error bound for this approximation that depends on all total variations of the probability density functions of the random variables in the model. We show that the error bound converges to zero if all these total variations converge to zero. Our convex approximation is a generalization of the one in C...
متن کاملA convex approximation for mixed-integer recourse models
We develop a convex approximation for two-stage mixed-integer recourse models and we derive an error bound for this approximation that depends on all total variations of the probability density functions of the random variables in the model. We show that the error bound converges to zero if all these total variations converge to zero. Our convex approximation is a generalization of the one in C...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2019
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-019-01368-1